منابع مشابه
Total perfect codes, OO-irredundant and total subdivision in graphs
Let $G=(V(G),E(G))$ be a graph, $gamma_t(G)$. Let $ooir(G)$ be the total domination and OO-irredundance number of $G$, respectively. A total dominating set $S$ of $G$ is called a $textit{total perfect code}$ if every vertex in $V(G)$ is adjacent to exactly one vertex of $S$. In this paper, we show that if $G$ has a total perfect code, then $gamma_t(G)=ooir(G)$. As a consequence, ...
متن کاملZagreb Indices and Coindices of Total Graph, Semi-Total Point Graph and Semi-Total Line Graph of Subdivision Graphs
Expressions for the Zagreb indices and coindices of the total graph, semi-total point graph and of semi-total line graph of subdivision graphs in terms of the parameters of the parent graph are obtained, thus generalizing earlier existing results.
متن کاملTotal Parental Nutrition
Total parenteral nutrition or TPN is perhaps one of the most exciting technique$ that has come a-long in the last few years. TPN can be defined as the delivery of sufficient nutrition via the intra venous route to maintain an anabolic state in a patient without any oral intake over an extended period of time. The limit'ation of fulfatling the patient's nutritional requiremetlt by 5% or 10% ...
متن کاملTotal Dual Integrality 1.1 Total Unimodularity
where A and b are rational and the associate dual program min y b s.t. A y = c (2) y ≥ 0 Definition 1 The system of inequalities by Ax ≤ b is Total Dual Integral or TDI if for all integral vectors c the dual program has an integral solution whenever the optimal value is finite. The main result for today is Theorem 1 If Ax ≤ b is TDI and b is integral then P = {x : Ax ≤ b} is integral ∗ ∗ Proof:...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ARQ (Santiago)
سال: 2002
ISSN: 0717-6996
DOI: 10.4067/s0717-69962002005200017